A uniqueness result concerning a robust regularized least-squares solution
نویسندگان
چکیده
In solving a robust version of regularized least-squares with weighting, a certain scalar-valued optimization problem is required in order to determine the regularized robust solution and the corresponding robustified weighting parameters. This letter establishes that the required optimization problem does not have local, non-global minima over the interval of interest. This property is proved by resorting to a useful Schur complementation argument. The result is reassuring in that it demonstrates that the robust design procedure is well defined and that its optimal global solution can be determined without concerns about local minima.
منابع مشابه
Costs and benefits of robust optimization
In this exposition the robust counterpart approach by Ben-Tal, El Ghaoui and Nemirovski is investigated with respect to its costs and benefits, with the focus on the costs of robustification. Although robust optimization has gained more and more interest among both academics and practitioners and although this certainly represents a well-established theory, it is to some extent unclear, if and ...
متن کاملApplications of regularized least squares to pattern classification
We survey a number of recent results concerning the behaviour of algorithms for learning classifiers based on the solution of a regularized least-squares problem. c © 2007 Elsevier B.V. All rights reserved.
متن کاملRegularized fractional derivatives in Colombeau algebra
The present study aims at indicating the existence and uniqueness result of system in extended colombeau algebra. The Caputo fractional derivative is used for solving the system of ODEs. In addition, Riesz fractional derivative of Colombeau generalized algebra is considered. The purpose of introducing Riesz fractional derivative is regularizing it in Colombeau sense. We also give a solution to...
متن کاملAsymptotics of Gaussian Regularized Least Squares
We consider regularized least-squares (RLS) with a Gaussian kernel. We prove that if we let the Gaussian bandwidth σ → ∞ while letting the regularization parameter λ→ 0, the RLS solution tends to a polynomial whose order is controlled by the rielative rates of decay of 1 σ2 and λ: if λ = σ−(2k+1), then, as σ →∞, the RLS solution tends to the kth order polynomial with minimal empirical error. We...
متن کاملA Robust Minimum-Variance Filter for Time Varying Uncertain Discrete-Time Systems
A robust filter is designed for uncertain discrete time models. The filter is based on a regularized solution and guarantees minimum state error variance. Simulation results confirm its superior performance over other robust filter designs. keywords: regularization, least-squares, robust filter, regularization parameter, parametric uncertainty.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Systems & Control Letters
دوره 46 شماره
صفحات -
تاریخ انتشار 2002